FPGA Implementation of Modular Exponentiation for RSA Cryptosystem

نویسندگان

  • M. Issad
  • B. Boudraa
  • M. Anane
چکیده

In this paper, the implementation of RSA (Rivest, Shamir and Adleman) cryptosystem using Hardware/Software (HW/SW) co-design approach is presented. The main function of RSA is the Modular Exponentiation (ME) which is accomplished by repeated Modular Multiplications (MM’s) on large integers. In this work, we propose the implementation of the ME as a Programmable System on Chip (PSoC), using the soft processor core MicroBlaze of Xilinx. In the proposed embedded system, the control of the ME algorithm is executed by the embedded processor, while the MM’s are computed within specific hardware. Because, the MM is usually considered as timeconsuming, the Montgomery modular multiplication algorithm is employed to realize our accelerator customized IP (Intellectual Property). The results show that the application to RSA 1024bits, the execution time of the ME is about 15.14 ms Keywords— RSA, Montgomery Modular Multiplication, FPGA, PSoC.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Modular Exponentiation Architectures for RSA Algorithm

-Cryptosystems are used to send confidential messages in secure manner. The most important and efficient type of cryptosystem is RSA. RSA is used in various sectors such as Bank security and Internet protection. One of the various steps involved in RSA is Modular exponentiation, which is used in both Encryption and Decryption. It takes high memory and computation time of algorithm. In order to ...

متن کامل

Modular exponentiation using parallel multipliers

A field programmable gate array (FPGA) semi-systolic implementation of a modular exponentiation unit, suitable for use in implementing the RSA public key cryptosystem is presented. The design is carefully matched with features of the FPGA architecture, utilizing embedded 18×18-bit multipliers on the FPGA and employing a carry save addition scheme. Using this architecture, a 1024-bit modular exp...

متن کامل

Modified Montgomery for RSA Cryptosystem

Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular Multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitio...

متن کامل

FPGA Implementation of Modular Exponentiation Using Single Modular Multiplier

This paper presents the FPGA implementation of Modular Exponentiation (ME), based on Software/Hardware (SW/HW) approach. Indeed, in Rivest, Shamir and Adleman (RSA) cryptosystem, ME which is computed by series of Modular Multiplications (MM’s), is the main function to encrypt and decrypt data. In order to achieve the best trade-off between area, speed and flexibility, we propose in this work an...

متن کامل

Radix – 4 Implementation of a Montgomery Multiplier for a RSA Cryptosystem

As cryptosystems become more important to computing, so does the need to make the encryption and decryption of larger and stronger keys faster. The RSA algorithm presents one of these problems specifically in performing modular exponentiation. A popular method to implement the necessary modular multiplication and squaring required for exponentiation is the Montgomery Multiplication (MM) algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014